The Mathematical Safe Problem and Its Solution (Part 2)

Introduction. The problem of mathematical safe arises in the theory computer games and cryptographic applications. article considers numerous variations examples its solution using systems linear Diophantine equations finite rings fields. purpose article. To present methods for solving a various variations, which are related both to domain over is considered structure these domains. consider (in matrix graph forms) different domains demonstrate work this their efficiency (systems simple fields, ghost associative-commutative rings). Results. Examples safe, conditions existence solutions areas, considered. choice appropriate area considered, algorithm it depends on number positions latches safe. All algorithms accompanied by estimates time complexity, were first part paper. Conclusions. fields allow solve large formulation (over prime field, primary ring with unit). Keywords: rings, method, algorithm.